BCA Symposium Considers Diffraction from Nearly Perfect Crystals
نویسندگان
چکیده
منابع مشابه
A Nearly Perfect Market?
Internet shopbots allow consumers to almost instantly compare prices and other characteristics from dozens of sellers via a single website. We estimate the magnitude of consumer search costs and benefits using data from a major shopbot for books. For the median consumer, the estimated benefit from simply scrolling down to search lower screens is $6.55. This amounts to about 60% of the observed ...
متن کاملNearly perfect fluidity
Shear viscosity is a measure of the amount of dissipation in a simple fluid. In kinetic theory shear viscosity is related to the rate of momentum transport by quasi-particles, and the uncertainty relation suggests that the ratio of shear viscosity η to entropy density s in units of h̄/kB is bounded by a constant. Here, h̄ is Planck’s constant and kB is Boltzmann’s constant. A specific bound has b...
متن کاملPerfect crystals grown from imperfect interfaces
The fabrication of advanced devices increasingly requires materials with different properties to be combined in the form of monolithic heterostructures. In practice this means growing epitaxial semiconductor layers on substrates often greatly differing in lattice parameters and thermal expansion coefficients. With increasing layer thickness the relaxation of misfit and thermal strains may cause...
متن کاملGraphene: a nearly perfect fluid.
Hydrodynamics and collision-dominated transport are crucial to understand the slow dynamics of many correlated quantum liquids. The ratio eta/s of the shear viscosity eta to the entropy density s is uniquely suited to determine how strongly the excitations in a quantum fluid interact. We determine eta/s in clean undoped graphene using a quantum kinetic theory. As a result of the quantum critica...
متن کاملNearly perfect sets in graphs
In a graph G = (V; E), a set of vertices S is nearly perfect if every vertex in V ? S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and eecient dominating sets. We say a nearly perfect set S is 1-minimal if for every vertex u in S, the set S ? fug is not nearly perfect. Similarly, a nearly perfect s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MRS Bulletin
سال: 1988
ISSN: 0883-7694,1938-1425
DOI: 10.1557/s0883769400064460